Low-cost scheduling algorithms for distributed-memory architectures
نویسندگان
چکیده
One of the main problems in the field of scheduling algorithms for distributed memory systems is finding heuristics that produce good schedules at a low cost. We propose two new approaches for the scheduling problem. Both algorithms are intended to be used at compile time, to schedule task graphs on a distributed systems. Compared to known scheduling algorithms, the proposed algorithms preserve output performance while reducing complexity.
منابع مشابه
GLB: a low-cost scheduling algorithm for distributed-memory architectures
This paper proposes a new compile time scheduling algorithm for distributed-memory systems, called Global Load Balancing (GLB). GLB is intended as the second step in the multi-step class of scheduling algorithms. Experimental results show that compared with known scheduling algorithms of the same low-cost complexity, the proposed algorithm improves schedule lengths up to 30%. Compared to algori...
متن کاملLow-Cost Task Scheduling for Distributed-Memory Machines
ÐIn compile-time task scheduling for distributed-memory systems, list scheduling is generally accepted as an attractive approach since it pairs low cost with good results. List scheduling algorithms schedule tasks in order of their priority. This priority can be computed either 1) statically, before the scheduling, or 2) dynamically, during the scheduling. In this paper, we show that list sched...
متن کاملList Heuristic Scheduling Algorithms for Distributed Memory Systems with Improved Time Complexity
We present a compile time list heuristic scheduling algorithm called Low Cost Critical Path algorithm (LCCP) for the distributed memory systems. LCCP has low scheduling cost for both homogeneous and heterogeneous systems. In some recent papers list heuristic scheduling algorithms keep their scheduling cost low by using a fixed size heap and a FIFO, where the heap always keeps fixed number of ta...
متن کاملMulti-objective and Scalable Heuristic Algorithm for Workflow Task Scheduling in Utility Grids
To use services transparently in a distributed environment, the Utility Grids develop a cyber-infrastructure. The parameters of the Quality of Service such as the allocation-cost and makespan have to be dealt with in order to schedule workflow application tasks in the Utility Grids. Optimization of both target parameters above is a challenge in a distributed environment and may conflict one an...
متن کاملPreemptive Task Scheduling for Distributed Systems
Task scheduling in a preemptive runtime environment has potential advantages over the non-preemptive case such as better processor utilization and more flexibility when scheduling tasks. Furthermore, preemptive approaches may need less runtime support (e.g. no task ordering required). In contrast to the non-preemptive case, preemptive task scheduling in a distributed system has not received muc...
متن کامل